NSDA: A Novel Node Selecting Optimal Algorithm Based on Dijkstra
نویسندگان
چکیده
منابع مشابه
NSDA: A Novel Node Selecting Optimal Algorithm Based on Dijkstra
This paper first represent the basic conceptions of anonymous communication, then introduce the fundamentals in Anonymous Communication. Afterwards, we went deep to the classification of anonymous network topological, therefore we could get a better understanding on P2P anonymous communication system. We also systematically analyzes the existing node-select algorithms. Furthermore, we propose a...
متن کاملOptimal Portfolio Allocation based on two Novel Risk Measures and Genetic Algorithm
The problem of optimal portfolio selection has attracted a great attention in the finance and optimization field. The future stock price should be predicted in an acceptable precision, and a suitable model and criterion for risk and the expected return of the stock portfolio should be proposed in order to solve the optimization problem. In this paper, two new criterions for the risk of stock pr...
متن کاملA Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra Algorithm
Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for ...
متن کاملA Novel Method for Selecting the Supplier Based on Association Rule Mining
One of important problems in supply chains management is supplier selection. In a company, there are massive data from various departments so that extracting knowledge from the company’s data is too complicated. Many researchers have solved this problem by some methods like fuzzy set theory, goal programming, multi objective programming, the liner programming, mixed integer programming, analyti...
متن کاملA Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem
A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Generation Communication and Networking
سال: 2016
ISSN: 2233-7857,2233-7857
DOI: 10.14257/ijfgcn.2016.9.6.11